• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Ȩ Ȩ > ¿¬±¸¹®Çå >

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Çù¾÷ ÇÊÅ͸µÀ» »ç¿ëÇÑ À¯»çµµ ±â¹ý ¹× Ä¿¹Â´ÏƼ °ËÃâ ¾Ë°í¸®Áò ºñ±³
¿µ¹®Á¦¸ñ(English Title) Comparison of similarity measures and community detection algorithms using collaboration filtering
ÀúÀÚ(Author) ÀÏȨÁ¸   È«¹ÎÇ¥   ¹ÚµÎ¼ø   Sadriddinov Ilkhomjon Rovshan Ugli      Hong Minpyo   Doo-Soon Park  
¿ø¹®¼ö·Ïó(Citation) VOL 29 NO. 01 PP. 0366 ~ 0369 (2022. 05)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
The glut of information aggravated the process of data analysis and other procedures including data mining. Many algorithms were devised in Big Data and Data Mining to solve such an intricate problem. In this paper, we conducted research about the comparison of several similarity measures and community detection algorithms in collaborative filtering for movie recommendation systems. Movielense data set was used to do an empirical experiment. We applied three different similarity measures: Cosine, Euclidean, and Pearson. Moreover, betweenness and eigenvector centrality were used to detect communities from the network. As a result, we elucidated which algorithm is more suitable than its counterpart in terms of recommendation accuracy.
Å°¿öµå(Keyword)
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå